STUMM : A COMPARISON OF BLOCKING AND NON - BLOCKING NETWORKS 3 Output Link Input Link Ring Buffer Output

نویسندگان

  • G Ravindran
  • M Stumm
چکیده

SUMMARY This paper presents the results of a simulation study of blocking and non-blocking switching for hierarchical ring networks. The switching techniques include wormhole, virtual cut-through, and slotted ring. We conclude that slotted ring network performs better than the more popular wormhole and virtual cut-through networks. We also show that the size of the node buuers is an important parameter and that choosing them too large can hurt performance in some cases. Slotted rings have the advantage that the choice of buuer size is easier in that larger than necessary buuers do not hurt performance and hence a single choice of buuer size performs well for all system conngurations. In contrast, the optimal buuer size for virtual cut-through and wormhole switching nodes varies depending on the system con-guration and the level in the hierarchy in which the switching node lies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RAVINDRAN and STUMM : A COMPARISON OF BLOCKING AND NON - BLOCKING NETWORKS 3 Output Link Input Link Ring Buffer Output

SUMMARY This paper presents the results of a simulation study of blocking and non-blocking switching for hierarchical ring networks. The switching techniques include wormhole, virtual cut-through, and slotted ring. We conclude that slotted ring network performs better than the more popular wormhole and virtual cut-through networks. We also show that the size of the node buuers is an important p...

متن کامل

A Switch Scheduling Problem for Real-time Periodic Messages

This paper presents several eecient heuristic algorithms for scheduling real-time periodic messages in a satellite-switched time-division multiple access (SS/TDMA) system. Previous work in this area considers messages with identical periods and solves the time-slot assignment (TSA) problem which nds connict-free schedules while minimizing the transmission schedule length and the number of switc...

متن کامل

Delay-bound guarantee in combined input-output buffered switches

A bstrucrCIOB (Combined Input-Output Buffered) switches with a moderate speedup have been widely considered as the most feasiblesolution for large-capacity switches. In this paper, we adopt the hierarchical link sharing (HLS) algorithm in non-blocking CIOB switches to guarantee delay bound that is independent of the switch size. We also propose a feasible architecture to implement the HLS algor...

متن کامل

The Least Choice First (LCF) Scheduling Methodfor High-speed Network Switches

We describe a novel method for scheduling high-speed network switches. The targeted architecture is an input-buffered switch with a non-blocking switch fabric. The input buffers are organized as virtual output queues to avoid head-of-line blocking. The task of the scheduler is to decide when the input ports can forward packets from the virtual output queues to the corresponding output ports. Ou...

متن کامل

Stochastic Comparison Results for Non-Blocking Switches with Output Queueing

We propose a systematic approach to quantify the impact of nonuniform tra c on the performance of non{blocking switches with output queueing. We do so in the context of a simple queueing model where cells arrive to input ports according to independent Bernoulli processes, and are switched to an output port under a random routing mechanism. We give conditions on pairs of input rate vectors and s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996